On graphs with equal total domination and connected domination numbers
نویسنده
چکیده
A subset S of V is called a total dominating set if every vertex in V is adjacent to some vertex in S. The total domination number γt (G) of G is the minimum cardinality taken over all total dominating sets of G. A dominating set is called a connected dominating set if the induced subgraph 〈S〉 is connected. The connected domination number γc(G) of G is the minimum cardinality taken over all minimal connected dominating sets of G. In this work, we characterize trees and unicyclic graphs with equal total domination and connected domination numbers. © 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
A cactus graph is a connected graph in which any two cycles have at most one vertex in common. Let γ(G) and γc(G) be the domination number and connected domination number of a graph G, respectively. We can see that γ(G) ≤ γc(G) for any graph G. S. Arumugam and J. Paulraj Joseph [1] have characterized trees, unicyclic graphs and cubic graphs with equal domination and connected domination numbers...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملTotal $k$-Rainbow domination numbers in graphs
Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...
متن کاملOn Roman, Global and Restrained Domination in Graphs
In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total restrained domination numbers for large classes of graphs, and show that, for almost all graphs, the restrained domination number is equal to the domination num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006